@InProceedings{MarianoSouzEndoVija:2016:CoStAl,
               author = "Mariano, Matheus Monteiro and Souza, {\'E}rica Ferreira de and 
                         Endo, Andr{\'e} Takeshi and Vijaykumar, Nandamudi Lankalapalli",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and 
                         {Universidade Tecnologica Federal do Paran{\'a} (UTFPR)} and 
                         {Universidade Tecnologica Federal do Paran{\'a} (UTFPR)} and 
                         {Instituto Nacional de Pesquisas Espaciais (INPE)}",
                title = "A comparative study of algorithms for generating switch cover test 
                         sets",
            booktitle = "Proceedings...",
                 year = "2016",
                pages = "1--15",
         organization = "Simp{\'o}sio Brasileiro de Qualidade de Software, 15. (SBQS 
                         2016)",
             abstract = "Test case generation based on Finite State Machines (FSMs) has 
                         been extensively investigated due to its accuracy and simplicity. 
                         Several test criteria have been proposed in the literature to 
                         generate test cases based on FSMs. One of the oldest criteria is 
                         the Switch Cover. As a main feature, the Switch Cover criterion 
                         defines that all transition pairs of an FSM must be covered. The 
                         classical Switch Cover algorithm converts the FSM into a graph 
                         (known as Dual Graph); this graph is balanced, and, finally, 
                         traversed based on an Eulerian Cycle algorithm. In this context, 
                         considering the stage where an FSM is converted into a graph, this 
                         study investigates other search algorithms on graphs, namely 
                         Depth-First Search (DFS) and Breadth-First Search (BFS), for 
                         generating test sets from a Dual Graph. We presented an 
                         experimental study that compares the DFS, BFS algorithms with the 
                         Eulerian Cycle. The study was conducted with a set of random and 
                         real-world machines, taking into account the number of test cases, 
                         the test suite size, the average length of sequences and 
                         generation time.",
  conference-location = "Macei{\'o}, AL",
      conference-year = "24-26 out.",
                label = "lattes: 7074181888782869 1 MarianoSouzEndoVija:2016:CoStAl",
             language = "en",
           targetfile = "mariano_comparative.pdf",
        urlaccessdate = "27 abr. 2024"
}